2 7 N ov 2 00 8 Matrix Ansatz , lattice paths and rook placements
نویسنده
چکیده
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with respect to the number of ascents and occurrences of the pattern 13-2, the generating function according to weak exceedances and crossings, and the n moment of certain q-Laguerre polynomials.
منابع مشابه
Matrix Ansatz, lattice paths and rook placements
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with respect to the number of ascents and occurrence...
متن کاملCombinatorics of the Three-Parameter PASEP Partition Function
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a generating function of permutation tableaux by the combinatorial interpretation of Corteel and Williams. We prove bijectively two new combinatorial interpretations. T...
متن کاملRook Placements in Young Diagrams and Permutation Enumeration
Abstract. Given two operators M and N subject to the relation MN −qNM = p, and a word w in M and N , the rewriting of w in normal form is combinatorially described by rook placements in a Young diagram. We give enumerative results about these rook placements, particularly in the case where p = (1−q)/q. This case naturally arises in the context of the PASEP, a random process whose partition func...
متن کاملJu n 20 00 From the Bethe Ansatz to the Gessel - Viennot Theorem
We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for the eigenvectors of suitable transfer matrices of a generalised inhomogeneous five-vertex model on the square lattice, given certain conditions hold, is equivalent to the Gessel-Viennot determinant for the number of configurations of N non-intersecting directed lattice paths, or vicious walkers, with variou...
متن کاملOn the Spectra of Simplicial Rook Graphs
The simplicial rook graph SR(d, n) is the graph whose vertices are the lattice points in the nth dilate of the standard simplex in R, with two vertices adjacent if they differ in exactly two coordinates. We prove that the adjacency and Laplacian matrices of SR(3, n) have integral spectra for every n. We conjecture that SR(d, n) is integral for all d and n, and give a geometric construction of a...
متن کامل